Ant Colony Optimization Techniques in MANET for Efficient Routing: A Survey
نویسندگان
چکیده
All networks tend to become a lot of and a lot of difficult. They’ll be wired, with several routers, or wireless, with several mobile nodes, the matter remains the same: so as to induce the best from the network, there's a requirement to search out the shortest path. The a lot of difficult the network is, the harder it's to manage the routes and indicate which one is that the best. The ants, in their necessity to search out food and brings it back to the nest, manage not only to explore a huge space, however additionally to point to their peers the location of the food whereas transportation it back to the nest. Thus, they grasp wherever their nest is, and additionally their destination, while not having a worldwide read of the bottom. Most of the time, they will notice the shortest path and adapt to ground changes, therefore proving their nice efficiency toward this tough task. In this work we proposed load balancing and reliability enhancement using Ant based approach in MANET. The Ant behaviour of follow search routing is on the basis of pheromones. The pheromones are injected by ant in a route and follow that route were the pheromones are more injected means that route is the suitable route for reaching to destination. In this paper we presents the different techniques of Ant Colony Optimization (ACO) that are improves the routing mechanism. Key Words—MANET, Ant, Pheromones, Survey, ACO
منابع مشابه
An Ant-Colony Optimization Clustering Model for Cellular Automata Routing in Wireless Sensor Networks
High efficient routing is an important issue for the design of wireless sensor network (WSN) protocols to meet the severe hardware and resource constraints. This paper presents an inclusive evolutionary reinforcement method. The proposed approach is a combination of Cellular Automata (CA) and Ant Colony Optimization (ACO) techniques in order to create collision-free trajectories for every agent...
متن کاملExpedition through Various Ant Based Routing Algorithms for MANETS
S.Mahima,MCA.M.Phil,Phd, Department of Computer Applications, Syed Ammal Arts and Science College, Ramanathapuram. Email: [email protected] M.Sudha,MCA.,M.Phil., Department of Computer Applications, Syed Ammal Arts and Science College, Ramanathapuram. Email: [email protected] -------------------------------------------------------------------ABSTRACT--------------------------------------...
متن کاملVOYAGING THROUGH VARIOUS ANT BASED ROUTING ALGORITHMS FOR MANETs
Mobile ad hoc network (MANET) consists of many wireless nodes or devices, placed together in an ad hoc manner and without the support of fixed infrastructure. All the nodes which are present in the network are mobile and can enter and leave the network any time. MANET serves the effective, operational bandwidth and have limited battery power for the nodes. Many different routing protocols and a...
متن کاملThe Efficient Ant Routing Protocol for MANET
In recent years, mobile computing and wireless networks have witnessed a tremendous rise in popularity and technological advancement. The basic routing problem in MANET deals with methods to transport a packet across a network from source node to destination node. Due to the dynamic nature of MANET, it is difficult to design effective routing algorithms. In this paper, we introduce a novel meta...
متن کاملA Hybrid Multi-agent Routing Algorithm based on Ant Colony Optimization for MANET
There are many routing algorithms are presented for Mobile Ad hoc Network such as Destination sequenced Distance Vector (DSDV) which is known as proactive routing algorithm based on routing table, due to continuously updating routing tables, it consumes large portion of network capacity. Another is Ad hoc on Demand Distance Vector (AODV) is known as reactive algorithm. In this algorithm, when p...
متن کامل